Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies
نویسندگان
چکیده
منابع مشابه
Multi-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملMultiple Batch Sizing through Batch Size Smoothing
Batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. The solution obtained from majority – e.g. MRP – is in this format that there may be some periods of idleness or each period should produce a...
متن کاملPower-optimal Simultaneous Buffer Insertion/sizing and Wire Sizing
This paper studies the problems of minimizing power dissipation of an interconnect wire by simultaneously considering buffer insertion/sizing and wire sizing (BISWS). We consider two cases, namely minimizing power dissipation with optimal delay constraints, and minimizing power dissipation with a given delay penalty. We derive closed form optimal solutions for both cases. These closed form solu...
متن کاملOn Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies
We consider a problem of multi-product lot-sizing and scheduling where each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require one or more machine at the same time. A sequence dependent setup time is needed between different technologies. The criterion is to minimize the makespan. Preemptive and non-preemptive versions of the proble...
متن کاملSolving Multi-level, Multi-product and Multi-period Lot Sizing and Scheduling Problem in Permutation Flow Shop
In this paper, a new model of capacitated lot sizing and scheduling in a permutation flow shop is developed. In this model demand can be totally backlogged. Setups can be carryover and are sequence-dependent. It is well-known from literatures that capacitated lot sizing problem in permutation flow shop systems are NP-hard. This means the model is solved in polynomial time and metaheuristics alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.03.020